1. Algorithmic aspects of graph connectivity

by Nagamochi, Hiroshi.

Material type: book Book; Format: print ; Literary form: Not fiction Publisher: New York: Cambridge University Press, 2008Availability: Items available for loan: [Call number: 511.5 NAG] (1).
2. Shared-memory parallelism can be simple, fast, and scalable

by Shun, Julian.

Edition: 1st ed.Material type: book Book; Format: print ; Literary form: Not fiction Publisher: UK: Morgan & Claypool, 2017Availability: Items available for loan: [Call number: 005.275 SHU] (1).

Powered by Koha